#include<bits/stdc++.h>
using namespace std;
int num=0,a[100005],w,ans,n,ge;
struct node{
    int value,shu;
}s[100005];
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>w;
        a[w]++;
        ans=max(ans,w);
    }
    for(int i=1;i<=ans;i++)
    {
        if(a[i]){
        if(s[num].value!=i)
        {
            num++;
            s[num].shu+=a[i];
            s[num].value=i;
        }
        }
        }
    for(int i=1;i<=num;i++)
    {

        if(ge<s[i].shu){
            ge=s[i].shu;
        }
        //cout<<s[i].value;
        }
        cout<<ge;
        return 0;
    }

